skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 5

Search for: All records

Creators/Authors contains: "Balogh, József"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; (, Journal of Graph Theory)
    ABSTRACT We study extensions of Turán Theorem in edge‐weighted settings. A particular case of interest is when constraints on the weight of an edge come from the order of the largest clique containing it. These problems are motivated by Ramsey‐Turán type problems. Some of our proofs are based on the method of graph Lagrangians, while the other proofs use flag algebras. Using these results, we prove several new upper bounds on the Ramsey‐Turán density of cliques. Other applications of our results are in a recent paper of Balogh, Chen, McCourt, and Murley. 
    more » « less
    Free, publicly-accessible full text available September 1, 2026
  2. ; ; (, Discrete Mathematics)
    Free, publicly-accessible full text available August 1, 2026
  3. ; ; (, Discrete & Computational Geometry)
    Free, publicly-accessible full text available April 1, 2026
  4. ; ; (, Illinois Journal of Mathematics)
    Free, publicly-accessible full text available April 1, 2026
  5. ; ; (, Journal of Graph Theory)
    Abstract In the Constructor–Blocker game, two players, Constructor and Blocker, alternately claim unclaimed edges of the complete graph . For given graphs and , Constructor can only claim edges that leave her graph ‐free, while Blocker has no restrictions. Constructor's goal is to build as many copies of as she can, while Blocker attempts to minimize the number of copies of in Constructor's graph. The game ends once there are no more edges that Constructor can claim. The score of the game is the number of copies of in Constructor's graph at the end of the game when both players play optimally and Constructor plays first. In this paper, we extend results of Patkós, Stojaković and Vizer on to many pairs of and : We determine when and , also when both and are odd cycles, using Szemerédi's Regularity Lemma. We also obtain bounds of when and . 
    more » « less
    Free, publicly-accessible full text available March 1, 2026
  6. ; ; (, Random Structures & Algorithms)
    ABSTRACT For graphs and , let be the minimum possible size of a maximum ‐free induced subgraph in an ‐vertex ‐free graph. This notion generalizes the Ramsey function and the Erdős–Rogers function. Establishing a container lemma for the ‐free subgraphs, we give a general upper bound on , assuming the existence of certain locally dense ‐free graphs. In particular, we prove that for every graph with , where , we have For the cases where is a complete multipartite graph, letting , we prove that We also make an observation which improves the bounds of by a polylogarithmic factor. 
    more » « less
    Free, publicly-accessible full text available January 1, 2026
  7. ; ; (, SIAM Journal on Discrete Mathematics)
    Free, publicly-accessible full text available December 31, 2025
  8. ; (, Combinatorica)
    Full Text Available 
  9. ; ; (, European Journal of Combinatorics)
    Full Text Available 
  10. ; ; ; (, SIAM Journal on Discrete Mathematics)
    Full Text Available